Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Computational logic and proof theory (Vienna, August 25-29, 1997)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 28

  • Page / 2
Export

Selection :

  • and

Computational logic and proof theory (Vienna, August 25-29, 1997)Gottlob, Georg; Leitsch, Alexander; Mundici, Daniele et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63385-5, VIII, 348 p, isbn 3-540-63385-5Conference Proceedings

Bounded hyperset theory and web-like data basesLISITSA, A; SAZONOV, V.Lecture notes in computer science. 1997, pp 172-185, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Resolution, inverse method and the sequent calculusTAMMET, T.Lecture notes in computer science. 1997, pp 65-83, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Subtyping over a latticeTIURYN, J.Lecture notes in computer science. 1997, pp 84-88, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Two connections between Linear Logic and Łukasiewicz LogicsCIABATTONI, A; LUCHI, D.Lecture notes in computer science. 1997, pp 128-139, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Informal rigor and mathematical understandingROBINSON, J. A.Lecture notes in computer science. 1997, pp 54-64, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Propositional quantification in intuitionistic logicPOŁACIK, T.Lecture notes in computer science. 1997, pp 255-263, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Translating set theoretical proofs into Type theoretical programsSETZER, A.Lecture notes in computer science. 1997, pp 278-289, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Ultrafilter logic and generic reasoningCARNIELLI, W. A; VELOSO, P. A. S.Lecture notes in computer science. 1997, pp 34-53, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Upper bounds for standardizations and an applicationXI, H.Lecture notes in computer science. 1997, pp 335-348, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Markov's rule is admissible in the set theory with intuitionistic logicKHAKHANIAN, V. KH.Lecture notes in computer science. 1997, pp 167-171, issn 0302-9743, isbn 3-540-63385-5Conference Paper

A new method for bounding the complexity of modal logicsBASIN, D; MATTHEWS, S; VIGANO, L et al.Lecture notes in computer science. 1997, pp 89-102, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Alogtime algorithms for tree isomorphism, comparison, and canonizationBUSS, S. R.Lecture notes in computer science. 1997, pp 18-33, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Invariant definabilityMAKOWSKY, J. A.Lecture notes in computer science. 1997, pp 186-202, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Looking for an analogue of rice's theorem in circuit complexity theoryBORCHERT, B; STEPHAN, F.Lecture notes in computer science. 1997, pp 114-127, issn 0302-9743, isbn 3-540-63385-5Conference Paper

NaDSyL and some applicationsGILMORE, P. C.Lecture notes in computer science. 1997, pp 153-166, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Paramodulation, superposition, and simplificationBACHMAIR, L.Lecture notes in computer science. 1997, pp 1-3, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Restart tableaux with selection functionPAPE, C; HÄHNLE, R.Lecture notes in computer science. 1997, pp 219-232, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Structuring of computer-generated proofs by cut introductionEGLY, U; GENTHER, K.Lecture notes in computer science. 1997, pp 140-152, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Two semantics and logics based on the Gödel interpretationPLISKO, V.Lecture notes in computer science. 1997, pp 233-240, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Sketch-as-proofPREINING, N.Lecture notes in computer science. 1997, pp 264-277, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Parameter free induction and reflectionBEKLEMISHEV, L. D.Lecture notes in computer science. 1997, pp 103-113, issn 0302-9743, isbn 3-540-63385-5Conference Paper

The tangibility reflection principle for self-verifying axiom systemsWILLARD, D. E.Lecture notes in computer science. 1997, pp 319-334, issn 0302-9743, isbn 3-540-63385-5Conference Paper

  • Page / 2